A robust, optimization-based approach for approximate answering of aggregate queries
نویسندگان
چکیده
منابع مشابه
Linear Sketches for Approximate Aggregate Range Queries
Answering aggregate queries approximately over multidimensional data is an important problem that arises naturally in many applications. An approach to the problem is to maintain a succinct (i.e. O(k) space) representation, called sketch, of the frequency distribution h of the data, and use ĥ for answering queries. Common sketches are constructed via linear mappings of h onto a k–dimensional sp...
متن کاملIntegrated planning for blood platelet production: a robust optimization approach
Perishability of blood products as well as uncertainty in demand amounts complicate the management of blood supply for blood centers. This paper addresses a mixed-integer linear programming model for blood platelets production planning while integrating the processes of blood collection as well as production/testing, inventory control and distribution. Whole blood-derived production methods for...
متن کاملAnswering Approximate Range Aggregate Queries on OLAP Data Cubes with Probabilistic Guarantees
Approximate range aggregate queries are one of the most frequent and useful kinds of queries for Decision Support Systems (DSS). Traditionally, sampling-based techniques have been proposed to tackle this problem. However, its effectiveness will degrade when the underlying data distribution is skewed. Another approach based on the outlier management can limit the effect of data skew but fails to...
متن کاملComplexity of Answering Counting Aggregate Queries over DL-Lite
The ontology based data access model assumes that users access data by means of an ontology, which is often described in terms of description logics. As a consequence, languages for managing ontologies now need algorithms not only to decide standard reasoning problems, but also to answer databaselike queries. However, fundamental database aggregate queries, such as the ones using functions COUN...
متن کاملA Robust Knapsack Based Constrained Portfolio Optimization
Many portfolio optimization problems deal with allocation of assets which carry a relatively high market price. Therefore, it is necessary to determine the integer value of assets when we deal with portfolio optimization. In addition, one of the main concerns with most portfolio optimization is associated with the type of constraints considered in different models. In many cases, the resulted p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMOD Record
سال: 2001
ISSN: 0163-5808
DOI: 10.1145/376284.375694